Computing Zeros of Analytic Functions via Modiied Moments Based on Formal Orthogonal Polynomials Computing Zeros of Analytic Functions via Modiied Moments Based on Formal Orthogonal Polynomials Computing Zeros of Analytic Functions via Modified Moments Based on Formal Orthogonal Polynomials
نویسندگان
چکیده
We consider the problem of computing all the zeros of an analytic function that lie in the interior of a Jordan curve, together with their respective multiplicities. Our approach uses modiied moments based on formal orthogonal polynomials. Numerical experiments indicate that it is far superior to classical approaches, which consider the usually ill-conditioned map from the Newton sums to the unknowns. Abstract. We consider the problem of computing all the zeros of an analytic function that lie in the interior of a Jordan curve, together with their respective multiplicities. Our approach uses modiied moments based on formal orthogonal polynomials. Numerical experiments indicate that it is far superior to classical approaches, which consider the usually ill-conditioned map from the Newton sums to the unknowns.
منابع مشابه
On locating clusters of zeros of analytic functions
Given an analytic function f and a Jordan curve γ that does not pass through any zero of f , we consider the problem of computing all the zeros of f that lie inside γ, together with their respective multiplicities. Our principal means of obtaining information about the location of these zeros is a certain symmetric bilinear form that can be evaluated via numerical integration along γ. If f has ...
متن کاملOn the Condition of Orthogonal Polynomials via Modiied Moments
We consider the condition of orthogonal polynomials, encoded by the coeecients of their three-term recurrence relation, if the measure is given by modiied moments (i.e. integrals of certain polynomials forming a basis). The results concerning various polynomial bases are illustrated with simple examples of generating (possibly shifted) Chebyshev polynomials of rst and second kind.
متن کاملA combined symbolic and numerical algorithm for the computation of zeros of orthogonal polynomials and special functions
A Maple algorithm for the computation of the zeros of orthogonal polynomials (OPs) and special functions (SFs) in a given interval [x1, x2] is presented. The program combines symbolic and numerical calculations and it is based on fixed point iterations. The program uses as inputs the analytic expressions for the coefficients of the three-term recurrence relation and a differencedifferential rel...
متن کاملSome new families of definite polynomials and the composition conjectures
The planar polynomial vector fields with a center at the origin can be written as an scalar differential equation, for example Abel equation. If the coefficients of an Abel equation satisfy the composition condition, then the Abel equation has a center at the origin. Also the composition condition is sufficient for vanishing the first order moments of the coefficients. The composition conjectur...
متن کاملNumerical solution of delay differential equations via operational matrices of hybrid of block-pulse functions and Bernstein polynomials
In this paper, we introduce hybrid of block-pulse functions and Bernstein polynomials and derive operational matrices of integration, dual, differentiation, product and delay of these hybrid functions by a general procedure that can be used for other polynomials or orthogonal functions. Then, we utilize them to solve delay differential equations and time-delay system. The method is based upon e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010